A Proof System for Temporal Reasoning with Sequential Information

نویسنده

  • Norihiro Kamide
چکیده

A new logic, sequence-indexed linear-time temporal logic (SLTL), is obtained semantically from the standard linear-time temporal logic LTL by adding a sequence modal operator which represents a sequence of symbols. By the sequence modal operator of SLTL, we can appropriately express “sequential information” in temporal reasoning. A Gentzen-type sequent calculus for SLTL is introduced, and the completeness and cut-elimination theorems for this calculus are proved. SLTL is also shown to be PSPACE-complete and embeddable into LTL.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Verification of Concurrent Systems using Symbolic Execution

This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known and very intuitive strategy for the verification of sequential programs. We have carried over this approach to the interactive verification of arbitrary linear temporal logic properties of (infinite state) parallel prog...

متن کامل

An Algebraic Approach to Temporal Logic

A b s t r a c t . The sequential calculus is an algebraic calculus, intended for reasoning about phenomena with a duration and their sequencing. It can be specialized to various domains used for reasoning about programs and systems, including Tarski's calculus of binary relations, Kleene's regular expressions, Hoare's CSP and Dijkstra's regularity calculus. In this paper we use the sequential c...

متن کامل

A Theory and Calculus for Reasoning about Sequential Behavior

Basic results in combinatorial mathematics provide the foundation for a theory and calculus for reasoning about sequential behavior. A key concept of the theory is a generalization of Boolean implicant in which one now deals with statements of the form: A sequence of Boolean expressions α is an implicant of a set of sequences of Boolean expressions A This notion of a generalized implicant takes...

متن کامل

Mixed Qualitative/Quantitative Dynamic Simulation of Processing Systems

In this article the methodology proposed by Li and Wang for mixed qualitative and quantitative modeling and simulation of temporal behavior of processing unit is reexamined and extended to more complex case. The main issue of their approach considers the multivariate statistics of principal component analysis (PCA), along with clustered fuzzy digraphs and reasoning. The PCA and fuz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010